Heal Gossip: A Secure Overlay for Unstructured P2P Networks

نویسندگان

  • Anubhava Srivastava
  • Dharmendra Kumar
چکیده

Gossip-based protocols are an e cient mechanism for man-aging pure unstructured peer-to-peer (P2P) networks. Such protocols are Newscast, Cyclone, Lbpcast, etc. They have overcome from several di culties of such P2P random overlay connection. Such difficulties are randomness, high churn rate, very large unstructured distributed net-work, etc. But the performance of all gossip-based protocols have been completely vanished by presence of few malicious nodes. Since, non-detectable messages and behaviour of attackers are not leave them se-cure. These malicious nodes divide the overlay into several isolated clusters such as in Hub Attack or may be engaged non-malicious nodes in such a way that they are denying actual work such as in Denial of Ser-vice (DoS) Attacks. For securing unstructured P2P networks, there are some existing security protocols such as Secure Peer Sampling (SPSS), TooLate, S-Gossip etc. They are able to identify the malicious nodes and restrict them from gossiping. But restricting some malicious nodes on each node is not sufficient the security purpose of such epidemic over-lays. Especially in completely distributed networks, the malicious nodes may affect other non-malicious nodes although they have been already captured and restricted for gossip on others. In this regards, a new gossip mechanism is proposed, named HealGos-sip. It uses an additional property to inform captured malicious nodes on a node to all its neighbours. This process helps to identify and re-strict malicious nodes faster than other security mechanism. The propose mechanism relief the non-malicious nodes from the group of malicious nodes while performing detecting process. Hence, the propose protocol reduces the communication overhead as well as paralyses almost all malicious nodes within the network. For confusing among malicious and non-malicious nodes while detecting, a new variant of Hub attack is pro-posed and is called Hide and Seek (HnS) attack. It is able to miss-lead existing security protocols regarding the restriction of malicious nodes from gossip.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Topology Adaptation Protocol for Structured Superpeer Overlay Construction

Peer-to-peer networks can be divided into structured and unstructured based on their overlay topologies. In reality, unstructured p2p networks with superpeers have proved their capacities to support millions of users simultaneously. However, applications deployed on this kind of overlay networks, such as file-sharing, require flooding or gossip-based message routing, which puts more overhead on...

متن کامل

Searching in Unstructured Overlays Using Local Knowledge and Gossip

* This paper analyzes a class of dissemination algorithms for the discovery of distributed contents in Peer-to-Peer unstructured overlay networks. The algorithms are a mix of protocols employing local knowledge of peers’ neighborhood and gossip. By tuning the gossip probability and the depth k of the k-neighborhood of which nodes have information, we obtain different dissemination protocols emp...

متن کامل

Gossip-Based Reputation Management for Unstructured Peer-to-Peer Networks*

To build an efficient reputation system for peer-to-peer (P2P) networks, we need fast mechanisms to aggregate peer evaluations and to disseminate updated scores to a large number of peer nodes. Unfortunately, unstructured P2P networks are short of secure hashing and fast lookup mechanisms as in structured P2P systems like the DHT-based Chord. In light of this shortcoming, we propose a gossiping...

متن کامل

Gossiping for resource discovering: An analysis based on complex network theory

This paper analyzes the adoption of unstructured P2P overlay networks to build resource discovery services. We consider a simple distributed communication protocol, which is based on gossip and on the local knowledge each node has about resources hold by its neighbors. In particular, upon reception (or generation) of a novel query, a node relays the message to those neighbors that have resource...

متن کامل

A Fully Distributed Lagrangean Metaheuristic for a P2P Overlay Network Design Problem

In peer-to-peer (P2P) networks it is a central problem to maintain a so called overlay network with certain desired properties. An overlay network is defined by logical connections (i.e., the ”who knows whom” relation) between peers over an underlying physical network. If node i is connected to node j in an overlay network, it means that node i knows the address of j and so it can send messages...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016